منابع مشابه
Tool for robust stochastic parsing using optimal maximum coverage
This report presents a robust syntactic parser that is able to return a “correct” derivation tree even if the grammar cannot generate the input sentence. The following two steps solution is proposed: the finest corresponding most probable optimal maximum coverage is generated first, then the trees from this coverage are glued into one resulting tree. We discuss the implementation of this method...
متن کاملMaximum Coverage in WSN using Optimal Deployment Technique
Present sensors are inbuilt with sensing capabilities, battery, mobilization and storage capability, for better monitoring of targets and storage of information regarding targets. The sensors can be static or dynamic, depending upon their application. Since the dynamic sensors are costlier, hence are used for supreme purpose. Here we suggest an algorithm for distributed sensor network consistin...
متن کاملThe Maximum Coverage Set Calculated Algorithm for WSN Area Coverage
The Coverage Control Technology is one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting users’ perception demand. Among this, in the study of area coverage, the set K-cover algorithm is broadly accepted because that it can prolong network lifetime rather well. However, maximum set covers problem is pr...
متن کاملMaximum Coverage Representative Skyline
Skyline queries represent a dataset by the points on its pareto frontier, but can become very large. To alleviate this problem, representative skylines select exactly k skyline points. However, existing approaches are not scaleinvariant, not stable, or must materialise the entire skyline. We introduce the maximum coverage representative skyline, which returns the k points collectively dominatin...
متن کاملOnline Maximum k-Coverage
We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V , such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Wireless Communications Letters
سال: 2014
ISSN: 2162-2337,2162-2345
DOI: 10.1109/lwc.2014.2342736